Extremal Graph for Intersecting Odd Cycles
نویسندگان
چکیده
منابع مشابه
Extremal Graph for Intersecting Odd Cycles
An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...
متن کاملExtremal results for odd cycles in sparse pseudorandom graphs
We consider extremal problems for subgraphs of pseudorandom graphs. Our results implies that for (n, d, λ)-graphs Γ satisfying λ2k−1 ≪ d 2k n (log n)−2(k−1)(2k−1) any subgraph G ⊂ Γ not containing a cycle of length 2k + 1 has relative density at most 12 + o(1). Up to the polylog-factor the condition on λ is best possible and was conjectured by Krivelevich, Lee and Sudakov.
متن کاملExtremal graphs for intersecting cliques
For any two positive integers nXrX1; the well-known Turán Theorem states that there exists a least positive integer exðn;KrÞ such that every graph with n vertices and exðn;KrÞ þ 1 edges contains a subgraph isomorphic to Kr: We determine the minimum number of edges sufficient for the existence of k cliques with r vertices each intersecting in exactly one common vertex. r 2003 Elsevier Science (U...
متن کاملExtremal Graphs for Intersecting Triangles
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex. 1 Notation With integers n ≥ p ≥ 1, we let Tn,p denote the Turán graph, i.e., the complete p-partite graph on n vertices where each partite set...
متن کاملMoore Graphs and Cycles Are Extremal Graphs for Convex Cycles
Let ρ(G) denote the number of convex cycles of a simple graph G of order n, size m, and girth 3 ≤ g ≤ n. It is proved that ρ(G) ≤ ng (m−n+ 1) and that equality holds if and only if G is an even cycle or a Moore graph. The equality also holds for a possible Moore graph of diameter 2 and degree 57 thus giving a new characterization of Moore graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5851